The sum numbers and the integral sum numbers of Cn and Wn

Let G = (V,E) be a simple graph with the vertex set V and the edge set E. G is a sum graph if there exists a labelling f of the vertices of G into distinct positive integers such that uv ∈ E if and only if f(w) = f(u) + f(v) for some vertex w ∈ V . Such a labelling f is called a sum labelling of G. The sum number σ(G) of G is the smallest number of isolated vertices which result in a sum graph when added to G. Similarly, the integral sum graph and the integral sum number ζ(G) are also defined. The difference is that the labels may be any distinct integers. In this paper, we will determine that ⎪⎪⎪⎪⎨ ⎪⎪⎪⎩ 0 = ζ(P4) < σ(P4) = 1; 1 = ζ(P5) < σ(P5) = 2; 3 = ζ(P6) < σ(P6) = 4; ζ(Pn) = σ(Pn) = 0, n = 1, 2, 3; ζ(Pn) = σ(Pn) = 2n− 7, n ≥ 7. and ⎪⎪⎨ ⎪⎪⎩ 0 = ζ(F5) < σ(F5) = 1; 2 = ζ(F6) < σ(F6) = 3; ζ(Fn) = σ(Fn) = 0, n = 3, 4; ζ(Fn) = σ(Fn) = 2n− 8, n ≥ 7.